On Rectangular Partitionings in
نویسنده
چکیده
منابع مشابه
ua nt - p h / 01 04 04 3 v 1 9 A pr 2 00 1 Moller operators and Lippmann - Schwinger equations for step - like potentials
The Moller operators and the asociated Lippman-Schwinger equations obtained from different partitionings of the Hamiltonian for a step-like potential barrier are worked out, compared and related.
متن کاملEvolutionary Fractal Image
This paper introduces evolutionary computing to frac-tal image compression. In fractal image compression 1] a partitioning of the image into ranges is required. We propose to use evolutionary computing to nd good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of N p conng-urations, each of which is a partitioning with a fractal code. In the evolu...
متن کاملParametric GPU Code Generation for Affine Loop Programs
Partitioning a parallel computation into finitely sized chunks for effective mapping onto a parallel machine is a critical concern for source-to-source compilation. In the context of OpenCL and CUDA, this translates to the definition of a uniform hyper-rectangular partitioning of the parallel execution space where each partition is subject to a fine-grained distribution of resources that has a ...
متن کاملLearning a similarity-based distance measure for image database organization from human partitionings of an image set
In this paper we employ human judgments of image similarity to improve the organization of an image database. We first derive a statistic, B which measures the agreement between two partitionings of an image set. B is used to assess agreement both amongst and between human and machine partitionings. This provides a rigorous means of choosing between competing image database organization systems...
متن کاملOrder-p: an Algorithm to Order Network Partitionings
A network partitioning is said to occur when failures fragment the network into two or more sub-networks. This causes the performance of the network to degrade and many techniques have been proposed to combat this degradation. The number of possible partitionings in a fully connected network of n nodes is greater than 2 n , for large n. Thus, the analysis of partitioning-resilient algorithms is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010